منابع مشابه
Class forcing, the forcing Theorem and Boolean Completions
The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a condition in the relevant generic filter. We show that both the definability (and, in fact, even the amenability) of the forcing relation and the truth lemma ca...
متن کاملCompletions of Z=(p)-Tate cohomology of periodic spectra
We construct splittings of some completions of the Z/(p)–Tate cohomology of E(n) and some related spectra. In particular, we split (a completion of) tE(n) as a (completion of) a wedge of E(n−1)’s as a spectrum, where t is shorthand for the fixed points of the Z/(p)–Tate cohomology spectrum (ie the Mahowald inverse limit lim ←− k (P−k ∧ΣE(n))). We also give a multiplicative splitting of tE(n) af...
متن کاملSpectra of Finitely Generated Boolean Flows
A flow on a compact Hausdorff space X is given by a map t : X → X. The general goal of this paper is to find the “cyclic parts” of such a flow. To do this, we approximate (X, t) by a flow on a Stone space (that is, a totally disconnected, compact Hausdorff space). Such a flow can be examined by analyzing the resulting flow on the Boolean algebra of clopen subsets, using the spectrum defined in ...
متن کاملLearning Boolean functions with concentrated spectra
This paper discusses the theory and application of learning Boolean functions that are concentrated in the Fourier domain. We first estimate the VC dimension of this function class in order to establish a small sample complexity of learning in this case. Next, we propose a computationally efficient method of empirical risk minimization, and we apply this method to the MNIST database of handwrit...
متن کاملDegree Spectra of Relations on Boolean Algebras
We show that every computable relation on a computable Boolean algebra B is either definable by a quantifier-free formula with constants from B (in which case it is obviously intrinsically computable) or has infinite degree spectrum. Computable mathematics has been the focus of a large amount of research in the past few decades. Computable model theory in particular has seen vigorous and varied...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1981
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-113-3-165-173